Hierarchical Clustering with Simple Matching and Joint Entropy Dissimilarity Measure
نویسندگان
چکیده
منابع مشابه
Dissimilarity Clustering by Hierarchical Multi-Level Refinement
We introduce in this paper a new way of optimizing the natural extension of the quantization error using in k-means clustering to dissimilarity data. The proposed method is based on hierarchical clustering analysis combined with multi-level heuristic refinement. The method is computationally efficient and achieves better quantization errors than the relational k-means.
متن کاملIterative Multiple Component Analysis with an Entropy-based Dissimilarity Measure
In this paper we study the notion of entropy for a set of attributes of a table and propose a novel method to measure the dissimilarity of categorical data. Experiments show that our estimation method improves the accuracy if the popular unsupervised Self Organized Map (SOM), in comparison to Euclidean or Mahalanobis distance. The distance comparison is applied for clustering of multidimensiona...
متن کاملClustering with Missing Features: A Penalized Dissimilarity Measure based approach
Many real-world clustering problems are plagued by incomplete data characterized by missing or absent features for some or all of the data instances. Traditional clustering methods cannot be directly applied to such data without preprocessing by imputation or marginalization techniques. In this article, we put forth the concept of Penalized Dissimilarity Measures which estimate the actual dista...
متن کاملClustering and a Dissimilarity Measure for Methadone Dosage Time Series
In this work we analyze data for 314 participants of a methadone study over 180 days. Dosages in mg were converted for better interpretability to seven categories in which six categories have an ordinal scale for representing dosages and one category for missing dosages. We develop a dissimilarity measure and cluster the time series using “partitioning around medoids” (PAM). The dissimilarity m...
متن کاملSpectral Graph Theoretic Analysis of Tsallis Entropy-based Dissimilarity Measure
In this paper we introduce a nonextensive quantum information theoretic measure which may be defined between any arbitrary number of density matrices, and we analyze its fundamental properties in the spectral graph-theoretic framework. Unlike other entropic measures, the proposed quantum divergence is symmetric, matrix-convex, theoretically upper-bounded, and has the advantage of being generali...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Modern Applied Statistical Methods
سال: 2014
ISSN: 1538-9472
DOI: 10.22237/jmasm/1398918000